Eikonal-based region growing for efficient clustering
نویسندگان
چکیده
منابع مشابه
Eikonal-based region growing for efficient clustering
We describe an Eikonal-based algorithm for computing dense oversegmentation of an image, often called superpixels. This oversegmentation respect local image boundaries while limiting undersegmentation. The proposed algorithm relies on a region growing scheme, where the potential map used is not xed and evolves during the di usion. Re nement steps are also proposed to enhance at low cost the rst...
متن کاملAn Efficient Agglomerative Clustering Algorithm for Region Growing
This paper proposes an eficient agglomerative clustering algorithm for region growing. To speed up the search of the best pair of segments which is merged into one segment, dissimilarity values of all possible pairs of segments are stored in a heap. Then the best pair can be found as the element of the root node of the binary tree corresponding to the heap. Since the only adjacent pairs of segm...
متن کاملClustering Based Region Growing Algorithm for Color Image Segmentation
We propose an image segmentation method based on combining unsupervised clustering in the color space with region growing in the image space. No ‘a priori’ knowledge is required about the number of regions in the image. The algorithm is useful for marker extraction or complete segmentation of multidimensional, and in particular color, images. The running time depends mostly upon the speed of th...
متن کاملEfficient Dense Matching for Textured Scenes using Region Growing
We present a simple and efficient dense matching method based on region growing techniques, which can be applied to a wide range of globally textured images like many outdoor scenes. Our method can deal with non-rigid scenes and large camera motions. First a few highly distinctive features like points or areas are extracted and matched. These initial matches are then used in a correlation-based...
متن کاملWatershed based region growing algorithm
This paper presents a solution to a major drawback of watershed transformation: over segmentation. The solution utilizes one of its main advantages – very good edge extraction. It is a method that simulates pouring water onto a landscape created on a basis of a digital image. Unfortunately transformation produces a region for each local minimum so, usually, the number of watersheds (catchment b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image and Vision Computing
سال: 2014
ISSN: 0262-8856
DOI: 10.1016/j.imavis.2014.10.002